Building fences around the chromatic coefficients
نویسندگان
چکیده
منابع مشابه
A Numerical Study on Flow around Nonuniform Porous Fences
The effects of a porous fence with a nonuniform porosity on flow fields are investigated numerically. First, an experiment with a non-uniform porous fence located in a wind tunnel is performed to obtain a reference data set. Then, a numerical model that utilizes the finite volume schemewith a weakly compressible-flowmethod to solve the continuity and momentum equations is developed. The numeric...
متن کاملChromatic Coefficients of Linear Uniform Hypergraphs
A simple hypergraph H=(X, E), with order |X| and size m=|E|, consists of a vertex-set V(H)=X and an edge-set E(H)=E, where E X and |E| 2 for each edge E in E. H is linear if no two edges intersect in more than one vertex, and H is h-uniform, or is an h-hypergraph, if |E|=h for each E in E. The number of edges containing a vertex x is its degree dH(x). Two vertices u, v of H are in the same comp...
متن کاملDivisibility of certain coefficients of the chromatic polynomials
This note presents some results on the divisibility of certain coe"cients of the chromatic polynomials. c © 2003 Elsevier B.V. All rights reserved.
متن کاملUpper Bound for the Coefficients of Chromatic polynomials
This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If ar is the coefficient of the q r term in the chromatic polynomial P (G, q), where q is the number of colors, then we find ar ≤ ( e v−r ) − ( e−g+2 v−r−g+2 ) + ( e−kg−g+2 v−r−g+2 ) − ∑kg−lg n=1 ∑lg−1 m=1 ( e−g+1−n−m v−r−g ) − δg,3 ∑kg+l ∗ g+1 −lg ...
متن کاملChromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients
We study the complexity of computing the coefficients of three classical polynomials, namely the chromatic, flow and reliability polynomials of a graph. Each of these is a specialisation of the Tutte polynomial Σtijxy . It is shown that, unless NP = RP , many of the relevant coefficients do not even have good randomised approximation schemes. We consider the quasiorder induced by approximation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1997
ISSN: 0364-9024,1097-0118
DOI: 10.1002/(sici)1097-0118(199711)26:3<123::aid-jgt2>3.0.co;2-t